Back to course home
0% completed
Vote For New Content
Tree Depth Pattern (easy)
Introduction to Tree Depth Pattern
Maximum Depth (or Height) of Binary Tree (easy)
Solution: Maximum Depth (or Height) of Binary Tree
Minimum Depth of a Binary Tree (easy)
Solution: Minimum Depth of a Binary Tree
Balanced Binary Tree (easy)
Solution: Balanced Binary Tree
Tree Diameter (easy)
Solution: Tree Diameter
Maximum Depth of N-ary Tree (easy)
Solution: Maximum Depth of N-ary Tree
Find maximum depth of subtree (medium)
Solution: Find maximum depth of subtree
Tree Breadth First Search (BFS) Pattern (easy)
Introduction to Tree Breadth First Search Pattern
Sum of Nodes with Even-Valued Grandparent (medium)
Solution: Sum of Nodes with Even-Valued Grandparent
All Nodes Distance K in Binary Tree (medium)
Solution: All Nodes Distance K in Binary Tree
Level Order Successor (easy)
Solution: Level Order Successor
Connect Level Order Siblings (medium)
Solution: Connect Level Order Siblings
Connect All Level Order Siblings (medium)
Solution: Connect All Level Order Siblings
Tree Depth First Search (DFS) Pattern (medium)
Introduction to Tree Depth First Search Pattern
Binary Tree Path Sum (easy)
Solution: Binary Tree Path Sum
Count Good Nodes in Binary Tree (medium)
Solution: Count Good Nodes in Binary Tree
Path Sum III (medium)
Solution: Path Sum III
Validate Binary Search Tree (medium)
Solution: Validate Binary Search Tree
Maximum Difference Between Node and Ancestor (medium)
Solution: Maximum Difference Between Node and Ancestor
Root to Leaf Path Pattern (medium)
Introduction to Root to Leaf Path Pattern
Binary Tree Paths (easy)
Solution: Binary Tree Paths
Sum of Root To Leaf Binary Numbers (easy)
Solution: Sum of Root To Leaf Binary Numbers
Insufficient Nodes in Root to Leaf Paths (medium)
Solution: Insufficient Nodes in Root to Leaf Paths
Smallest String Starting From Leaf (medium)
Solution: Smallest String Starting From Leaf
Pseudo-Palindromic Paths in a Binary Tree (medium)
Solution: Pseudo-Palindromic Paths in a Binary Tree
All Paths for a Sum (medium)
Solution: All Paths for a Sum
Sum of Path Numbers (medium)
Solution: Sum of Path Numbers
Path With Given Sequence (medium)
Solution: Path With Given Sequence
Count Paths for a Sum (medium)
Solution: Count Paths for a Sum
Leaf Processing Pattern (medium)
Introduction to Leaf Processing Pattern
Sum of Left Leaves (easy)
Solution: Sum of Left Leaves
Leaf-Similar Trees (easy)
Solution: Leaf-Similar Trees
Check if all leaves are at same level (medium)
Solution: Check if all leaves are at same level
Delete Leaves With a Given Value (medium)
Solution: Delete Leaves With a Given Value
Deepest Leaves Sum (medium)
Solution: Deepest Leaves Sum
Tree View Pattern (medium)
Introduction to Tree View Pattern
Right View of a Binary Tree (medium)
Solution: Right View of a Binary Tree
Top View Of the Binary Tree (medium)
Solution: Top View Of the Binary Tree
Bottom View Of the Binary Tree (medium)
Solution: Bottom View Of the Binary Tree
Boundary of Binary Tree (medium)
Solution: Boundary of Binary Tree
Comparison of Two Trees Pattern (medium)
Introduction to Comparison of Two Trees Pattern
Symmetric Tree (easy)
Solution: Symmetric Tree
Mirror Image Trees (medium)
Solution: Mirror Image Trees
Subtree of Another Tree (easy)
Solution: Subtree of Another Tree
Isomorphic Trees (medium)
Solution: Isomorphic Trees
Serialize and Deserialize Tree Pattern (hard)
Introduction to Serialize and Deserialize Tree Pattern
Serialize and Deserialize BST (medium)
Solution: Serialize and Deserialize BST
Verify Preorder Serialization of a Binary Tree (medium)
Solution: Verify Preorder Serialization of a Binary Tree
Create Binary Tree From Descriptions (medium)
Solution: Create Binary Tree From Descriptions
Serialize and Deserialize N-ary Tree (hard)
Solution: Serialize and Deserialize N-ary Tree
Reverse Level Order Traversal (easy)
Problem Statement
Given the root of a binary tree, return the bottom-up level order traversal of its nodes' values. (i.e., the lowest level comes first in left to right order.)
Examples
Example 1
- Input: root = [1, 2, 3, 4, 5, 6, 7]
- Expected Output: [[4, 5, 6, 7], [2, 3], [1]]
- Justification:
- The third level has
4,5,6, and7nodes. - The second level has
2and3nodes. - The first level has a single node with the value
1.
- The third level has
Example 2
- Input: root = [12, 7, 1, null, 9, 10, 5]
- Expected Output: [[9, 10, 5], [7, 1], [12]]
- Justification:
- The third level has
9,10, and5nodes. - The second level has
7and1nodes. - The first level has a single node with the value
12.
- The third level has
Example 3
- Input: root = [6,5,2,null,null,1,6,3,56,3]
- Expected Output: [[3,56,3],[1,6],[5,2],[6]]
- Justification:
- The fourth level has
3,56, and3nodes. - The third level has
1, and6nodes. - The second level has
5and2nodes. - The first level has a single node with the value
6.
- The fourth level has
Constraints:
- The number of nodes in the tree is in the range
[0, 2000]. -1000 <= Node.val <= 1000
Try it yourself
Try solving this question here:
Java
. . . .
Introduction to Level Order Traversal Pattern
Solution: Reverse Level Order Traversal
Mark as Completed
On this page
Problem Statement
Examples
Try it yourself